Maximum work revisited (Letters)

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proof-of-work, revisited

Bitcoin is a decentralized cryptocurrency implemented on top of a data structure called blockchain. Blockchain platforms allow a set of parties in a peer to peer network to maintain a ledger of transactions without relying on a central authority. These parties are also responsible to validate transactions and to extend the chain by generating proofs of work (i.e., cryptographic puzzles). Proofs...

متن کامل

Maximum Contact Map Overlap Revisited

Among the measures for quantifying the similarity between three-dimensional (3D) protein structures, maximum contact map overlap (CMO) received sustained attention during the past decade. Despite this, the known algorithms exhibit modest performance and are not applicable for large-scale comparison. This article offers a clear advance in this respect. We present a new integer programming model ...

متن کامل

Slim – an Early Work Revisited∗

An early, but at the time illuminating, piece of work on how to deal with a general, linearly coupled accelerator lattice is revisited. This work is based on the SLIM formalism developed in 1979-1981.

متن کامل

Chain-Ladder as Maximum Likelihood Revisited

It has long been known that maximum likelihood estimation in a Poisson model reproduces the chain-ladder technique. We revisit this model. A new canonical parametrisation is proposed to circumvent the inherent identification problem in the parametrisation. The maximum likelihood estimators for the canonical parameter are simple, interpretable and easy to derive. The boundary problem where all o...

متن کامل

The multiroute maximum flow problem revisited

We are given a directed network G = (V,A, u) with vertex set V , arc set A, a source vertex s ∈ V , a destination vertex t ∈ V , a finite capacity vector u = {uij}ij∈A, and a positive integer m ∈ Z+. The multiroute maximum flow problem (m-MFP) generalizes the ordinary maximum flow problem by seeking a maximum flow from s to t subject to not only the regular flow conservation constraints at the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Chemical Education

سال: 1964

ISSN: 0021-9584,1938-1328

DOI: 10.1021/ed041p675.1